Geodesic complexity of motion planning
نویسندگان
چکیده
We introduce the geodesic complexity of a metric space, inspired by topological space. Both them are numerical invariants, but, while TC only depends on homotopy type, GC is an invariant under isometries. show that in many cases they coincide but we also develop tools to distinguish two range examples. To this end, study what denote total cut locus, which does not appear have been explicitly considered literature. knowledge author, new Furthermore, just like TC, has potential applications field robotics.
منابع مشابه
the effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
the effects of planning on accuracy and complexity of iranian efl students’ written narrative task performance
this study compared the different effects of form-focused guided planning vs. meaning-focused guided planning on iranian pre-intermediate students’ task performance. the study lasted for three weeks and concentrated on eight english structures. forty five pre-intermediate iranian students were randomly assigned to three groups of guided planning focus-on-form group (gpfg), guided planning focus...
15 صفحه اولTopological Complexity of Motion Planning
In this paper we study a notion of topological complexity TC(X) for the motion planning problem. TC(X) is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, TC(X) is the minimal number k such that there are k different “motion planning rules”, each defined on an open subset of X×X, so that each rule is continuous in the source a...
متن کاملThe Computational Complexity of Motion Planning
In this paper we show that a generalization of a popular motion planning puzzle called Lunar Lockout is computationally intractable. In particular, we show that the problem is PSPACE-complete. We begin with a review of NP-completeness and polynomial-time reductions, introduce the class PSPACE, and motivate the significance of PSPACE-complete problems. Afterwards, we prove that determining wheth...
متن کاملComplexity of Control-Affine Motion Planning
In this paper we study the complexity of the motion planning problem for control-affine systems. Such complexities are already defined and rather well-understood in the particular case of nonholonomic (or driftless) systems. Our aim is to generalize these notions and results to systems with a drift. Accordingly, we present various definitions of complexity, as functions of the curve that is app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of applied and computational topology
سال: 2021
ISSN: ['2367-1726', '2367-1734']
DOI: https://doi.org/10.1007/s41468-020-00064-w